Interoperability, Trust Based Information Sharing Protocol and Security: Digital Government Key Issues

Improved interoperability between public and private organizations is of key significance to make digital government newest triumphant. Digital Government interoperability, information sharing protocol and security are measured the key issue for achieving a refined stage of digital government. Flawless interoperability is essential to share the information between diverse and merely dispersed organisations in several network environments by using computer based tools. Digital government must ensure security for its information systems, including computers and networks for providing better service to the citizens. Governments around the world are increasingly revolving to information sharing and integration for solving problems in programs and policy areas. Evils of global worry such as syndrome discovery and manage, terror campaign, immigration and border control, prohibited drug trafficking, and more demand information sharing, harmonization and cooperation amid government agencies within a country and across national borders. A number of daunting challenges survive to the progress of an efficient information sharing protocol. A secure and trusted information-sharing protocol is required to enable users to interact and share information easily and perfectly across many diverse networks and databases globally.Comment: 20 page

Multilevel Polarization of Polar Codes Over Arbitrary Discrete Memoryless Channels

It is shown that polar codes achieve the symmetric capacity of discrete memoryless channels with arbitrary input alphabet sizes. It is shown that in general, channel polarization happens in several, rather than only two levels so that the synthesized channels are either useless, perfect or "partially perfect". Any subset of the channel input alphabet which is closed under addition, induces a coset partition of the alphabet through its shifts. For any such partition of the input alphabet, there exists a corresponding partially perfect channel whose outputs uniquely determine the coset to which the channel input belongs. By a slight modification of the encoding and decoding rules, it is shown that perfect transmission of certain information symbols over partially perfect channels is possible. Our result is general regarding both the cardinality and the algebraic structure of the channel input alphabet; i.e we show that for any channel input alphabet size and any Abelian group structure on the alphabet, polar codes are optimal. It is also shown through an example that polar codes when considered as group/coset codes, do not achieve the capacity achievable using coset codes over arbitrary channels

Plane Symmetric Domain Wall in Lyra Geometry

In this paper general solutions are found for domain walls in Lyra geometry in the plane symmetric spacetime metric given by Taub. Expressions for the energy density and pressure of domain walls are derived in both cases of uniform and time varying displacement field $\beta$. It is also shown that the results obtained by Rahaman et al [IJMPD, {\bf 10}, 735 (2001)] are particular case of our solutions. Finally, the geodesic equations and acceleration of the test particle are discussed.Comment: Latex, 15 page